The minimal polynomial of 2cos(π/p) and its application to regular maps of large planar width

نویسنده

  • Mária Ipolyiová
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial

Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...

متن کامل

Topics on the Ratliff-Rush Closure of an Ideal

Introduction Let  be a Noetherian ring with unity and    be a regular ideal of , that is,  contains a nonzerodivisor. Let . Then . The :union: of this family, , is an interesting ideal first studied by Ratliff and Rush in [15]. ‎  The Ratliff-Rush closure of  ‎ is defined by‎ . ‎ A regular ideal  for which ‎‎ is called Ratliff-Rush ideal.‎‏‎ ‎ The present paper, reviews some of the known prop...

متن کامل

Regular Maps on Surfaces with Large Planar Width

A map is a cell decomposition of a closed surface; it is regular if its automorphism group acts transitively on the flags, mutually incident vertex-edge-face triples. The main purpose of this paper is to establish, by elementary methods, the following result: for each positive integer w and for each pair of integers p ≥ 3 and q ≥ 3 satisfying 1/p + 1/q ≤ 1/2, there is an orientable regular map ...

متن کامل

Invited Lecture: Silver Graphs: Achievements and New Challenges

p. 1 Invited Lecture: Online Algorithms: A Studyof Graph-Theoretic Concepts p. 10 Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions With Applications in the Textile and Car Manufacturing Industries p. 27 Informatica, Scuola, Communita: Uno Sguardo dall' Occhio del Ciclone p. 29 Proximity-Preserving Labeling Schemes and Their Applications p. 30 Euler...

متن کامل

Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2005